./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_end_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_linked_list_end_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 a49fa15b0860d2357f9ad3c8c6bab1d80cf83a6734355dc0b05c55121c837273 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:48:01,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:48:01,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 08:48:01,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:48:01,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:48:01,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:48:01,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:48:01,259 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:48:01,260 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:48:01,264 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:48:01,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:48:01,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:48:01,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:48:01,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:48:01,267 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:48:01,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:48:01,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:48:01,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:48:01,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:48:01,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:48:01,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:48:01,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:48:01,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:48:01,270 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:48:01,270 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:48:01,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:48:01,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:48:01,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:48:01,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:48:01,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:48:01,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:48:01,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:48:01,273 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:48:01,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:48:01,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:48:01,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:48:01,274 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:48:01,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:48:01,275 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:48:01,275 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 -> a49fa15b0860d2357f9ad3c8c6bab1d80cf83a6734355dc0b05c55121c837273 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:48:01,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:48:01,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:48:01,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:48:01,589 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:48:01,590 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:48:01,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_end_harness.i [2023-11-23 08:48:02,821 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:48:03,193 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:48:03,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_end_harness.i [2023-11-23 08:48:03,224 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/133535b88/6ad919a8c3bd4c3d8b602b836262522c/FLAG48521433b [2023-11-23 08:48:03,244 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/133535b88/6ad919a8c3bd4c3d8b602b836262522c [2023-11-23 08:48:03,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:48:03,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:48:03,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:48:03,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:48:03,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:48:03,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:48:03" (1/1) ... [2023-11-23 08:48:03,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d585c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:03, skipping insertion in model container [2023-11-23 08:48:03,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:48:03" (1/1) ... [2023-11-23 08:48:03,343 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:48:03,579 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_linked_list_end_harness.i[4493,4506] [2023-11-23 08:48:03,586 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_linked_list_end_harness.i[4553,4566] [2023-11-23 08:48:04,241 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,241 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,241 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,242 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,243 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,253 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,253 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,255 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,256 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,285 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,286 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,287 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,287 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,525 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:48:04,527 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:48:04,527 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:48:04,530 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:48:04,532 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:48:04,533 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:48:04,534 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:48:04,535 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:48:04,536 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:48:04,548 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:48:04,689 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:48:04,705 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:48:04,733 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_linked_list_end_harness.i[4493,4506] [2023-11-23 08:48:04,737 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_linked_list_end_harness.i[4553,4566] [2023-11-23 08:48:04,776 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,776 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,777 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,777 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,778 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,791 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,792 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,793 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,793 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,794 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,794 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,795 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,795 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:48:04,860 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:48:04,865 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:48:04,866 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:48:04,867 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:48:04,874 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:48:04,874 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:48:04,875 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:48:04,876 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:48:04,877 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:48:04,878 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:48:04,912 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:48:05,093 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:05,094 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:05,094 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:05,094 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:05,094 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:05,095 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:05,095 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:05,096 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:05,096 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:05,096 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:05,096 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:05,097 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:05,097 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:05,097 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:05,097 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:05,098 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:48:05,106 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:48:05,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:05 WrapperNode [2023-11-23 08:48:05,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:48:05,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:48:05,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:48:05,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:48:05,115 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:48:05" (1/1) ... [2023-11-23 08:48:05,190 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:48:05" (1/1) ... [2023-11-23 08:48:05,243 INFO L138 Inliner]: procedures = 678, calls = 1040, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 135 [2023-11-23 08:48:05,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:48:05,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:48:05,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:48:05,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:48:05,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:05" (1/1) ... [2023-11-23 08:48:05,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:05" (1/1) ... [2023-11-23 08:48:05,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:05" (1/1) ... [2023-11-23 08:48:05,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:05" (1/1) ... [2023-11-23 08:48:05,268 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:05" (1/1) ... [2023-11-23 08:48:05,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:05" (1/1) ... [2023-11-23 08:48:05,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:05" (1/1) ... [2023-11-23 08:48:05,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:05" (1/1) ... [2023-11-23 08:48:05,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:48:05,295 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:48:05,295 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:48:05,295 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:48:05,296 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:05" (1/1) ... [2023-11-23 08:48:05,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:48:05,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:05,327 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:48:05,337 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:48:05,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:48:05,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:48:05,387 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:48:05,388 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:48:05,388 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:48:05,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:48:05,388 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 08:48:05,388 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 08:48:05,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:48:05,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:48:05,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:48:05,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:48:05,389 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:48:05,390 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:48:05,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:48:05,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:48:05,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:48:05,390 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:48:05,391 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:48:05,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:48:05,613 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:48:05,615 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:48:05,812 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:48:05,865 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:48:05,866 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 08:48:05,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:48:05 BoogieIcfgContainer [2023-11-23 08:48:05,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:48:05,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:48:05,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:48:05,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:48:05,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:48:03" (1/3) ... [2023-11-23 08:48:05,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5522833b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:48:05, skipping insertion in model container [2023-11-23 08:48:05,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:05" (2/3) ... [2023-11-23 08:48:05,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5522833b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:48:05, skipping insertion in model container [2023-11-23 08:48:05,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:48:05" (3/3) ... [2023-11-23 08:48:05,879 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_end_harness.i [2023-11-23 08:48:05,894 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:48:05,894 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:48:05,961 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:48:05,974 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;@5604c07c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:48:05,974 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:48:05,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-23 08:48:05,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:48:05,995 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:05,996 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 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:48:05,997 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:06,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:06,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1341941210, now seen corresponding path program 1 times [2023-11-23 08:48:06,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:06,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997172769] [2023-11-23 08:48:06,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:06,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:06,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:06,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:06,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:06,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:48:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:06,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:48:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:06,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:48:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:06,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:48:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-23 08:48:06,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:06,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997172769] [2023-11-23 08:48:06,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997172769] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:06,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:48:06,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 08:48:06,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330989779] [2023-11-23 08:48:06,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:06,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 08:48:06,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:06,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 08:48:06,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:48:06,604 INFO L87 Difference]: Start difference. First operand has 59 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:06,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:06,663 INFO L93 Difference]: Finished difference Result 112 states and 168 transitions. [2023-11-23 08:48:06,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 08:48:06,666 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2023-11-23 08:48:06,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:06,674 INFO L225 Difference]: With dead ends: 112 [2023-11-23 08:48:06,675 INFO L226 Difference]: Without dead ends: 57 [2023-11-23 08:48:06,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:48:06,684 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:06,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:48:06,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-23 08:48:06,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-23 08:48:06,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 08:48:06,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2023-11-23 08:48:06,740 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 65 [2023-11-23 08:48:06,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:06,740 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2023-11-23 08:48:06,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:48:06,747 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2023-11-23 08:48:06,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:48:06,751 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:06,752 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 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:48:06,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 08:48:06,754 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:06,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:06,756 INFO L85 PathProgramCache]: Analyzing trace with hash -71337452, now seen corresponding path program 1 times [2023-11-23 08:48:06,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:06,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798249431] [2023-11-23 08:48:06,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:06,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:07,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:07,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:07,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:07,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:48:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:07,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:48:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:07,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:48:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:07,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:48:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:07,335 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 08:48:07,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:07,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798249431] [2023-11-23 08:48:07,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798249431] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:07,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890334340] [2023-11-23 08:48:07,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:07,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:07,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:07,339 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:48:07,343 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:48:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:07,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-23 08:48:07,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:07,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-23 08:48:07,676 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 18 treesize of output 19 [2023-11-23 08:48:07,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:07,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:07,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:07,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 47 [2023-11-23 08:48:07,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:07,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:07,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:07,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2023-11-23 08:48:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:48:08,508 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:08,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890334340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:08,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:08,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2023-11-23 08:48:08,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170884829] [2023-11-23 08:48:08,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:08,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 08:48:08,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:08,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 08:48:08,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:48:08,513 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:48:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:09,058 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2023-11-23 08:48:09,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:48:09,059 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2023-11-23 08:48:09,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:09,061 INFO L225 Difference]: With dead ends: 157 [2023-11-23 08:48:09,061 INFO L226 Difference]: Without dead ends: 110 [2023-11-23 08:48:09,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:48:09,063 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 71 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:09,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 306 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 08:48:09,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-23 08:48:09,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2023-11-23 08:48:09,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.36986301369863) internal successors, (100), 76 states have internal predecessors, (100), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2023-11-23 08:48:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 148 transitions. [2023-11-23 08:48:09,110 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 148 transitions. Word has length 65 [2023-11-23 08:48:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:09,111 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 148 transitions. [2023-11-23 08:48:09,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:48:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 148 transitions. [2023-11-23 08:48:09,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:48:09,117 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:09,118 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 08:48:09,154 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:48:09,336 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:48:09,337 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:09,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:09,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2120725294, now seen corresponding path program 1 times [2023-11-23 08:48:09,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:09,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415897516] [2023-11-23 08:48:09,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:09,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:09,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:09,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:09,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:09,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:48:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:09,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:48:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:09,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:48:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:09,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:48:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 08:48:09,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:09,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415897516] [2023-11-23 08:48:09,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415897516] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:09,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370118346] [2023-11-23 08:48:09,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:09,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:09,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:09,604 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:48:09,621 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:48:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:09,747 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-23 08:48:09,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:09,843 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2023-11-23 08:48:09,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 128 [2023-11-23 08:48:09,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2023-11-23 08:48:09,863 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:48:09,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-23 08:48:09,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 69 treesize of output 26 [2023-11-23 08:48:20,242 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:48:20,242 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:20,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370118346] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:20,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:20,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2023-11-23 08:48:20,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477548405] [2023-11-23 08:48:20,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:20,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:48:20,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:20,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:48:20,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=146, Unknown=3, NotChecked=0, Total=182 [2023-11-23 08:48:20,246 INFO L87 Difference]: Start difference. First operand 108 states and 148 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:48:22,262 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:48:24,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:48:26,846 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:48:28,870 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:48:30,895 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:48:32,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:32,523 INFO L93 Difference]: Finished difference Result 188 states and 261 transitions. [2023-11-23 08:48:32,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 08:48:32,524 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2023-11-23 08:48:32,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:32,526 INFO L225 Difference]: With dead ends: 188 [2023-11-23 08:48:32,526 INFO L226 Difference]: Without dead ends: 138 [2023-11-23 08:48:32,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=54, Invalid=215, Unknown=3, NotChecked=0, Total=272 [2023-11-23 08:48:32,527 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 96 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 20 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:32,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 347 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 265 Invalid, 8 Unknown, 0 Unchecked, 12.1s Time] [2023-11-23 08:48:32,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-23 08:48:32,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 126. [2023-11-23 08:48:32,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 91 states have internal predecessors, (122), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2023-11-23 08:48:32,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 172 transitions. [2023-11-23 08:48:32,575 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 172 transitions. Word has length 65 [2023-11-23 08:48:32,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:32,575 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 172 transitions. [2023-11-23 08:48:32,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:48:32,576 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 172 transitions. [2023-11-23 08:48:32,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:48:32,578 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:32,579 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 08:48:32,594 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:48:32,783 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:48:32,783 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:32,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:32,784 INFO L85 PathProgramCache]: Analyzing trace with hash -192452592, now seen corresponding path program 1 times [2023-11-23 08:48:32,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:32,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711037154] [2023-11-23 08:48:32,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:32,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:32,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:32,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:32,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:48:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:48:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:48:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:48:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,095 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 08:48:33,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:33,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711037154] [2023-11-23 08:48:33,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711037154] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:33,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830952300] [2023-11-23 08:48:33,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:33,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:33,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:33,097 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:48:33,098 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:48:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:33,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-23 08:48:33,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:33,283 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 18 treesize of output 19 [2023-11-23 08:48:33,304 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 18 treesize of output 19 [2023-11-23 08:48:33,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:33,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:33,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:33,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 47 [2023-11-23 08:48:33,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:33,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:33,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:48:33,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2023-11-23 08:48:34,861 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 08:48:34,862 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:48:34,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830952300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:48:34,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:48:34,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2023-11-23 08:48:34,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098530585] [2023-11-23 08:48:34,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:48:34,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:48:34,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:34,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:48:34,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:48:34,866 INFO L87 Difference]: Start difference. First operand 126 states and 172 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:48:35,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:48:35,487 INFO L93 Difference]: Finished difference Result 191 states and 259 transitions. [2023-11-23 08:48:35,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:48:35,489 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2023-11-23 08:48:35,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:48:35,492 INFO L225 Difference]: With dead ends: 191 [2023-11-23 08:48:35,492 INFO L226 Difference]: Without dead ends: 128 [2023-11-23 08:48:35,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:48:35,493 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 41 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 08:48:35,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 409 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 08:48:35,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-23 08:48:35,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2023-11-23 08:48:35,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 88 states have (on average 1.375) internal successors, (121), 91 states have internal predecessors, (121), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2023-11-23 08:48:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 171 transitions. [2023-11-23 08:48:35,512 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 171 transitions. Word has length 65 [2023-11-23 08:48:35,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:48:35,512 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 171 transitions. [2023-11-23 08:48:35,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:48:35,513 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 171 transitions. [2023-11-23 08:48:35,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:48:35,513 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:48:35,513 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 08:48:35,529 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:48:35,724 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:48:35,725 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:48:35,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:48:35,725 INFO L85 PathProgramCache]: Analyzing trace with hash -939759604, now seen corresponding path program 1 times [2023-11-23 08:48:35,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:48:35,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930434258] [2023-11-23 08:48:35,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:35,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:48:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:35,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:48:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:35,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:48:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:35,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:48:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:35,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:48:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:35,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:48:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:35,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:48:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:35,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:48:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 08:48:36,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:48:36,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930434258] [2023-11-23 08:48:36,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930434258] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:48:36,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282661481] [2023-11-23 08:48:36,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:48:36,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:48:36,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:48:36,024 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:48:36,041 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:48:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:48:36,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-23 08:48:36,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:48:36,249 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2023-11-23 08:48:36,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 128 [2023-11-23 08:48:36,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2023-11-23 08:48:36,265 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:48:36,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-23 08:48:36,297 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:48:36,298 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 0 case distinctions, treesize of input 41 treesize of output 13 [2023-11-23 08:48:36,300 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 13 treesize of output 9 [2023-11-23 08:48:38,360 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13|) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_13| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_13| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_13| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_13| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13| .cse0) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_4) .cse0))) (and (= (select |c_#memory_$Pointer$.base| .cse0) .cse1) (= v_DerPreprocessor_4 (store .cse1 .cse2 .cse0))))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13|)))) is different from true [2023-11-23 08:48:47,737 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_aws_linked_list_end_~list#1.offset| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|) .cse5))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13|) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_13| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_13| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_13| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_13| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13| .cse0) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_4) .cse0))) (and (= (select |c_#memory_$Pointer$.base| .cse0) .cse1) (= v_DerPreprocessor_4 (store .cse1 .cse2 .cse0))))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13|)))) (<= 2 |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|) (or (= .cse3 |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_3) |c_ULTIMATE.start_aws_linked_list_end_~list#1.base| v_DerPreprocessor_4) .cse3))) (and (= (store .cse4 .cse5 .cse3) v_DerPreprocessor_4) (= (select |c_#memory_$Pointer$.base| .cse3) .cse4))))) (<= |c_ULTIMATE.start_aws_linked_list_end_~list#1.base| .cse3) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_14| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_14| 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14|) .cse7))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14| v_DerPreprocessor_4) .cse8))) (and (= (store .cse6 .cse7 .cse8) v_DerPreprocessor_4) (= (select |c_#memory_$Pointer$.base| .cse8) .cse6)))) (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14| .cse8))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_14| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_14| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14|))))))) is different from true [2023-11-23 08:48:47,838 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13|) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_13| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_13| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_13| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_13| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13| .cse0) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_4) .cse0))) (and (= (select |c_#memory_$Pointer$.base| .cse0) .cse1) (= v_DerPreprocessor_4 (store .cse1 .cse2 .cse0))))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_4| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_4|) (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_4|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_4| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_4|) .cse4))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_4| v_DerPreprocessor_4) .cse5))) (and (= v_DerPreprocessor_4 (store .cse3 .cse4 .cse5)) (= (select |c_#memory_$Pointer$.base| .cse5) .cse3)))) (<= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_4| .cse5))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_4|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_14| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_14| 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14|) .cse7))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14| v_DerPreprocessor_4) .cse8))) (and (= (store .cse6 .cse7 .cse8) v_DerPreprocessor_4) (= (select |c_#memory_$Pointer$.base| .cse8) .cse6)))) (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14| .cse8))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_14| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14|) (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_14| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14|))))) is different from true [2023-11-23 08:48:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-11-23 08:48:49,098 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:48:49,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:48:49,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 318 treesize of output 310 [2023-11-23 08:48:49,451 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 162 treesize of output 146 [2023-11-23 08:48:49,499 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 129 treesize of output 117 [2023-11-23 08:48:49,787 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:48:49,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282661481] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:48:49,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:48:49,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 10] total 27 [2023-11-23 08:48:49,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618388390] [2023-11-23 08:48:49,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:48:49,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-23 08:48:49,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:48:49,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-23 08:48:49,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=461, Unknown=25, NotChecked=138, Total=702 [2023-11-23 08:48:49,790 INFO L87 Difference]: Start difference. First operand 126 states and 171 transitions. Second operand has 27 states, 22 states have (on average 4.0) internal successors, (88), 23 states have internal predecessors, (88), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2023-11-23 08:48:51,807 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:48:54,230 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:48:56,267 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:48:58,508 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:49:00,550 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:49:02,571 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:49:04,583 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:49:06,729 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:49:08,734 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:49:10,747 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:49:12,770 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:49:14,777 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:49:16,793 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:49:18,828 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:49:20,832 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:49:22,882 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:49:25,020 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:49:27,149 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:49:29,157 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:49:31,260 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:49:33,266 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:49:38,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:49:40,948 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:49:43,060 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:49:49,220 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:49:51,239 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:49:55,345 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:49:57,670 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:49:59,708 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:50:01,728 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:50:07,814 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:50:09,838 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:50:12,062 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:50:14,390 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:50:14,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:14,417 INFO L93 Difference]: Finished difference Result 273 states and 385 transitions. [2023-11-23 08:50:14,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-23 08:50:14,418 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 4.0) internal successors, (88), 23 states have internal predecessors, (88), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) Word has length 65 [2023-11-23 08:50:14,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:14,419 INFO L225 Difference]: With dead ends: 273 [2023-11-23 08:50:14,419 INFO L226 Difference]: Without dead ends: 145 [2023-11-23 08:50:14,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=154, Invalid=1147, Unknown=43, NotChecked=216, Total=1560 [2023-11-23 08:50:14,421 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 83 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 18 mSolverCounterUnsat, 77 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 77 IncrementalHoareTripleChecker+Unknown, 496 IncrementalHoareTripleChecker+Unchecked, 70.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:14,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 830 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 647 Invalid, 77 Unknown, 496 Unchecked, 70.2s Time] [2023-11-23 08:50:14,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-23 08:50:14,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 128. [2023-11-23 08:50:14,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 93 states have internal predecessors, (121), 24 states have call successors, (24), 12 states have call predecessors, (24), 13 states have return successors, (28), 22 states have call predecessors, (28), 22 states have call successors, (28) [2023-11-23 08:50:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 173 transitions. [2023-11-23 08:50:14,445 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 173 transitions. Word has length 65 [2023-11-23 08:50:14,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:14,446 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 173 transitions. [2023-11-23 08:50:14,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 4.0) internal successors, (88), 23 states have internal predecessors, (88), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2023-11-23 08:50:14,446 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 173 transitions. [2023-11-23 08:50:14,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-23 08:50:14,447 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:14,447 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 08:50:14,460 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:50:14,650 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:50:14,651 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:14,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:14,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1010151624, now seen corresponding path program 1 times [2023-11-23 08:50:14,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:14,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061117250] [2023-11-23 08:50:14,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:14,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:14,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:14,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:50:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:14,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:50:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:14,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:50:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:14,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 08:50:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:14,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:50:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:14,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:50:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:50:14,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:14,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061117250] [2023-11-23 08:50:14,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061117250] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:14,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638286464] [2023-11-23 08:50:14,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:14,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:14,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:14,899 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:50:14,900 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:50:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 08:50:15,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:50:15,112 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:50:15,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638286464] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:50:15,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:50:15,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-11-23 08:50:15,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580261450] [2023-11-23 08:50:15,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:50:15,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:50:15,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:15,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:50:15,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:50:15,115 INFO L87 Difference]: Start difference. First operand 128 states and 173 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:50:15,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:15,227 INFO L93 Difference]: Finished difference Result 241 states and 328 transitions. [2023-11-23 08:50:15,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:50:15,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2023-11-23 08:50:15,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:15,229 INFO L225 Difference]: With dead ends: 241 [2023-11-23 08:50:15,229 INFO L226 Difference]: Without dead ends: 134 [2023-11-23 08:50:15,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:50:15,230 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 32 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:15,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 232 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:50:15,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-23 08:50:15,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-11-23 08:50:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 99 states have internal predecessors, (125), 24 states have call successors, (24), 12 states have call predecessors, (24), 15 states have return successors, (32), 22 states have call predecessors, (32), 22 states have call successors, (32) [2023-11-23 08:50:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 181 transitions. [2023-11-23 08:50:15,249 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 181 transitions. Word has length 67 [2023-11-23 08:50:15,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:15,249 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 181 transitions. [2023-11-23 08:50:15,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:50:15,250 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 181 transitions. [2023-11-23 08:50:15,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-23 08:50:15,250 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:15,251 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 08:50:15,272 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:50:15,464 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:50:15,465 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:15,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:15,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1982015221, now seen corresponding path program 1 times [2023-11-23 08:50:15,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:15,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989460493] [2023-11-23 08:50:15,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:15,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:50:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:50:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:50:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:50:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:50:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:50:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,683 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-23 08:50:15,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:15,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989460493] [2023-11-23 08:50:15,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989460493] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:15,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392892036] [2023-11-23 08:50:15,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:15,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:15,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:15,686 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:50:15,701 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:50:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:15,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:50:15,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:50:15,903 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:50:15,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392892036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:50:15,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:50:15,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2023-11-23 08:50:15,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708845688] [2023-11-23 08:50:15,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:50:15,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:50:15,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:15,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:50:15,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:50:15,906 INFO L87 Difference]: Start difference. First operand 134 states and 181 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:50:16,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:16,089 INFO L93 Difference]: Finished difference Result 267 states and 366 transitions. [2023-11-23 08:50:16,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:50:16,091 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2023-11-23 08:50:16,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:16,092 INFO L225 Difference]: With dead ends: 267 [2023-11-23 08:50:16,092 INFO L226 Difference]: Without dead ends: 154 [2023-11-23 08:50:16,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:50:16,093 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 56 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:16,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 273 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:50:16,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-23 08:50:16,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 138. [2023-11-23 08:50:16,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 98 states have (on average 1.336734693877551) internal successors, (131), 103 states have internal predecessors, (131), 24 states have call successors, (24), 12 states have call predecessors, (24), 15 states have return successors, (32), 22 states have call predecessors, (32), 22 states have call successors, (32) [2023-11-23 08:50:16,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 187 transitions. [2023-11-23 08:50:16,111 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 187 transitions. Word has length 69 [2023-11-23 08:50:16,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:16,111 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 187 transitions. [2023-11-23 08:50:16,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:50:16,111 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 187 transitions. [2023-11-23 08:50:16,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 08:50:16,112 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:16,112 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 08:50:16,124 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:50:16,316 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:50:16,317 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:16,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:16,317 INFO L85 PathProgramCache]: Analyzing trace with hash 733632409, now seen corresponding path program 1 times [2023-11-23 08:50:16,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:16,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549984671] [2023-11-23 08:50:16,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:16,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:16,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:16,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:50:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:16,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:50:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:16,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:50:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:16,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:50:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:16,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:50:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:16,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-23 08:50:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:16,570 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-23 08:50:16,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:16,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549984671] [2023-11-23 08:50:16,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549984671] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:16,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372400845] [2023-11-23 08:50:16,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:16,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:16,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:16,573 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:50:16,574 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:50:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:16,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 08:50:16,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:16,729 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-23 08:50:16,730 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:50:16,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372400845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:50:16,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:50:16,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-11-23 08:50:16,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110825822] [2023-11-23 08:50:16,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:50:16,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 08:50:16,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:16,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 08:50:16,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:50:16,732 INFO L87 Difference]: Start difference. First operand 138 states and 187 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:50:16,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:16,777 INFO L93 Difference]: Finished difference Result 265 states and 368 transitions. [2023-11-23 08:50:16,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 08:50:16,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2023-11-23 08:50:16,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:16,780 INFO L225 Difference]: With dead ends: 265 [2023-11-23 08:50:16,780 INFO L226 Difference]: Without dead ends: 148 [2023-11-23 08:50:16,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:50:16,782 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 4 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:16,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 128 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:50:16,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-23 08:50:16,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 140. [2023-11-23 08:50:16,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 100 states have (on average 1.33) internal successors, (133), 105 states have internal predecessors, (133), 24 states have call successors, (24), 12 states have call predecessors, (24), 15 states have return successors, (32), 22 states have call predecessors, (32), 22 states have call successors, (32) [2023-11-23 08:50:16,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 189 transitions. [2023-11-23 08:50:16,805 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 189 transitions. Word has length 70 [2023-11-23 08:50:16,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:16,805 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 189 transitions. [2023-11-23 08:50:16,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:50:16,806 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 189 transitions. [2023-11-23 08:50:16,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 08:50:16,807 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:16,807 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 08:50:16,826 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:50:17,023 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:50:17,023 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:17,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:17,024 INFO L85 PathProgramCache]: Analyzing trace with hash 30271977, now seen corresponding path program 1 times [2023-11-23 08:50:17,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:17,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548951871] [2023-11-23 08:50:17,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:17,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:17,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:17,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:50:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:17,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:50:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:17,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:50:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:17,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:50:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:17,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:50:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:17,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:50:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:17,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 08:50:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 08:50:17,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:17,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548951871] [2023-11-23 08:50:17,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548951871] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:17,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629080269] [2023-11-23 08:50:17,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:17,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:17,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:17,313 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:50:17,331 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:50:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:17,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-23 08:50:17,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:17,509 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 13 treesize of output 1 [2023-11-23 08:50:17,511 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 13 treesize of output 1 [2023-11-23 08:50:18,403 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 08:50:18,404 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:50:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:50:18,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629080269] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:50:18,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:50:18,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 18, 12] total 32 [2023-11-23 08:50:18,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366783198] [2023-11-23 08:50:18,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:50:18,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-23 08:50:18,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:18,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-23 08:50:18,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2023-11-23 08:50:18,878 INFO L87 Difference]: Start difference. First operand 140 states and 189 transitions. Second operand has 32 states, 30 states have (on average 3.7666666666666666) internal successors, (113), 29 states have internal predecessors, (113), 10 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) [2023-11-23 08:50:21,138 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:50:23,745 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:50:26,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:26,484 INFO L93 Difference]: Finished difference Result 854 states and 1224 transitions. [2023-11-23 08:50:26,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-11-23 08:50:26,485 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 3.7666666666666666) internal successors, (113), 29 states have internal predecessors, (113), 10 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) Word has length 77 [2023-11-23 08:50:26,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:26,489 INFO L225 Difference]: With dead ends: 854 [2023-11-23 08:50:26,489 INFO L226 Difference]: Without dead ends: 681 [2023-11-23 08:50:26,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 154 SyntacticMatches, 7 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2444 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1114, Invalid=8198, Unknown=0, NotChecked=0, Total=9312 [2023-11-23 08:50:26,494 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 514 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 127 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:26,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 1529 Invalid, 1938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1809 Invalid, 2 Unknown, 0 Unchecked, 5.5s Time] [2023-11-23 08:50:26,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2023-11-23 08:50:26,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 480. [2023-11-23 08:50:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 355 states have (on average 1.3352112676056338) internal successors, (474), 370 states have internal predecessors, (474), 76 states have call successors, (76), 35 states have call predecessors, (76), 48 states have return successors, (131), 74 states have call predecessors, (131), 70 states have call successors, (131) [2023-11-23 08:50:26,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 681 transitions. [2023-11-23 08:50:26,559 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 681 transitions. Word has length 77 [2023-11-23 08:50:26,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:26,560 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 681 transitions. [2023-11-23 08:50:26,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 3.7666666666666666) internal successors, (113), 29 states have internal predecessors, (113), 10 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) [2023-11-23 08:50:26,561 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 681 transitions. [2023-11-23 08:50:26,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 08:50:26,563 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:26,563 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-11-23 08:50:26,578 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:50:26,772 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:50:26,773 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:26,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:26,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1196309970, now seen corresponding path program 1 times [2023-11-23 08:50:26,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:26,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709427752] [2023-11-23 08:50:26,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:26,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:27,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:27,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:50:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:27,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:50:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:27,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:50:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:27,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-23 08:50:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:27,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:50:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:27,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:50:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:27,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:50:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:27,264 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-23 08:50:27,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:27,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709427752] [2023-11-23 08:50:27,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709427752] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:27,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020606380] [2023-11-23 08:50:27,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:27,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:27,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:27,266 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:50:27,282 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:50:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:27,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-23 08:50:27,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:27,520 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 14 treesize of output 15 [2023-11-23 08:50:27,932 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:50:27,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:50:28,135 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 82 treesize of output 78 [2023-11-23 08:50:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:50:28,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020606380] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:50:28,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:50:28,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 10] total 25 [2023-11-23 08:50:28,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275270018] [2023-11-23 08:50:28,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:50:28,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-23 08:50:28,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:28,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-23 08:50:28,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2023-11-23 08:50:28,274 INFO L87 Difference]: Start difference. First operand 480 states and 681 transitions. Second operand has 25 states, 23 states have (on average 4.608695652173913) internal successors, (106), 25 states have internal predecessors, (106), 9 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (20), 7 states have call predecessors, (20), 9 states have call successors, (20) [2023-11-23 08:50:30,283 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:50:32,318 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:50:34,356 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:50:36,403 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:50:38,474 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:50:40,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:40,380 INFO L93 Difference]: Finished difference Result 1370 states and 2068 transitions. [2023-11-23 08:50:40,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-23 08:50:40,380 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.608695652173913) internal successors, (106), 25 states have internal predecessors, (106), 9 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (20), 7 states have call predecessors, (20), 9 states have call successors, (20) Word has length 79 [2023-11-23 08:50:40,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:40,386 INFO L225 Difference]: With dead ends: 1370 [2023-11-23 08:50:40,386 INFO L226 Difference]: Without dead ends: 895 [2023-11-23 08:50:40,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=430, Invalid=2222, Unknown=0, NotChecked=0, Total=2652 [2023-11-23 08:50:40,390 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 500 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 84 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:40,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 727 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 988 Invalid, 5 Unknown, 0 Unchecked, 11.2s Time] [2023-11-23 08:50:40,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2023-11-23 08:50:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 577. [2023-11-23 08:50:40,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 436 states have (on average 1.3555045871559632) internal successors, (591), 451 states have internal predecessors, (591), 92 states have call successors, (92), 35 states have call predecessors, (92), 48 states have return successors, (147), 90 states have call predecessors, (147), 86 states have call successors, (147) [2023-11-23 08:50:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 830 transitions. [2023-11-23 08:50:40,477 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 830 transitions. Word has length 79 [2023-11-23 08:50:40,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:40,478 INFO L495 AbstractCegarLoop]: Abstraction has 577 states and 830 transitions. [2023-11-23 08:50:40,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.608695652173913) internal successors, (106), 25 states have internal predecessors, (106), 9 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (20), 7 states have call predecessors, (20), 9 states have call successors, (20) [2023-11-23 08:50:40,478 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 830 transitions. [2023-11-23 08:50:40,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 08:50:40,480 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:40,481 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 08:50:40,500 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:50:40,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 08:50:40,697 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:40,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:40,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1982390060, now seen corresponding path program 1 times [2023-11-23 08:50:40,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:40,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467823276] [2023-11-23 08:50:40,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:40,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:40,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:40,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:50:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:40,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:50:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:41,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:50:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:41,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:50:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:41,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:50:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:41,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:50:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:41,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:50:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 08:50:41,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:41,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467823276] [2023-11-23 08:50:41,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467823276] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:41,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385909166] [2023-11-23 08:50:41,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:41,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:41,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:41,330 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:50:41,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-23 08:50:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:41,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-23 08:50:41,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:41,578 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:50:42,195 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 36 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 08:50:42,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:50:42,674 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 103 treesize of output 95 [2023-11-23 08:50:42,677 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 103 treesize of output 95 [2023-11-23 08:50:42,680 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 49 treesize of output 45 [2023-11-23 08:50:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:50:42,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385909166] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:50:42,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:50:42,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 15] total 39 [2023-11-23 08:50:42,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094374322] [2023-11-23 08:50:42,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:50:42,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-23 08:50:42,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:42,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-23 08:50:42,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1341, Unknown=0, NotChecked=0, Total=1482 [2023-11-23 08:50:42,733 INFO L87 Difference]: Start difference. First operand 577 states and 830 transitions. Second operand has 39 states, 34 states have (on average 3.823529411764706) internal successors, (130), 36 states have internal predecessors, (130), 15 states have call successors, (23), 3 states have call predecessors, (23), 9 states have return successors, (22), 10 states have call predecessors, (22), 15 states have call successors, (22) [2023-11-23 08:50:44,737 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:50:46,780 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:50:48,821 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:50:50,851 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:50:53,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:53,235 INFO L93 Difference]: Finished difference Result 2663 states and 3958 transitions. [2023-11-23 08:50:53,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-23 08:50:53,236 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 34 states have (on average 3.823529411764706) internal successors, (130), 36 states have internal predecessors, (130), 15 states have call successors, (23), 3 states have call predecessors, (23), 9 states have return successors, (22), 10 states have call predecessors, (22), 15 states have call successors, (22) Word has length 80 [2023-11-23 08:50:53,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:53,247 INFO L225 Difference]: With dead ends: 2663 [2023-11-23 08:50:53,247 INFO L226 Difference]: Without dead ends: 1802 [2023-11-23 08:50:53,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 155 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=784, Invalid=3908, Unknown=0, NotChecked=0, Total=4692 [2023-11-23 08:50:53,254 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 641 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 1835 mSolverCounterSat, 129 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1835 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:53,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1427 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1835 Invalid, 4 Unknown, 0 Unchecked, 9.3s Time] [2023-11-23 08:50:53,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2023-11-23 08:50:53,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1338. [2023-11-23 08:50:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 1046 states have (on average 1.3652007648183557) internal successors, (1428), 1081 states have internal predecessors, (1428), 190 states have call successors, (190), 68 states have call predecessors, (190), 101 states have return successors, (316), 188 states have call predecessors, (316), 178 states have call successors, (316) [2023-11-23 08:50:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1934 transitions. [2023-11-23 08:50:53,482 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1934 transitions. Word has length 80 [2023-11-23 08:50:53,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:53,482 INFO L495 AbstractCegarLoop]: Abstraction has 1338 states and 1934 transitions. [2023-11-23 08:50:53,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 34 states have (on average 3.823529411764706) internal successors, (130), 36 states have internal predecessors, (130), 15 states have call successors, (23), 3 states have call predecessors, (23), 9 states have return successors, (22), 10 states have call predecessors, (22), 15 states have call successors, (22) [2023-11-23 08:50:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1934 transitions. [2023-11-23 08:50:53,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 08:50:53,485 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:53,485 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 08:50:53,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-23 08:50:53,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-23 08:50:53,686 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:53,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:53,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1576219600, now seen corresponding path program 1 times [2023-11-23 08:50:53,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:53,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553706647] [2023-11-23 08:50:53,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:53,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:53,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:53,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:50:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:53,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:50:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:53,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:50:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:53,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:50:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:53,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:50:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:54,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:50:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:54,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:50:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 08:50:54,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:54,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553706647] [2023-11-23 08:50:54,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553706647] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:54,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993924420] [2023-11-23 08:50:54,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:54,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:54,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:54,041 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:50:54,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-23 08:50:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:54,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:50:54,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:54,281 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 08:50:54,281 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:50:54,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993924420] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:50:54,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:50:54,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2023-11-23 08:50:54,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863606529] [2023-11-23 08:50:54,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:50:54,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:50:54,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:54,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:50:54,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:50:54,283 INFO L87 Difference]: Start difference. First operand 1338 states and 1934 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:50:54,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:54,611 INFO L93 Difference]: Finished difference Result 3149 states and 4627 transitions. [2023-11-23 08:50:54,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:50:54,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 80 [2023-11-23 08:50:54,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:54,619 INFO L225 Difference]: With dead ends: 3149 [2023-11-23 08:50:54,619 INFO L226 Difference]: Without dead ends: 1114 [2023-11-23 08:50:54,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:50:54,628 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 35 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:54,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 302 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:50:54,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2023-11-23 08:50:54,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1114. [2023-11-23 08:50:54,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 840 states have (on average 1.3107142857142857) internal successors, (1101), 869 states have internal predecessors, (1101), 178 states have call successors, (178), 68 states have call predecessors, (178), 95 states have return successors, (287), 176 states have call predecessors, (287), 166 states have call successors, (287) [2023-11-23 08:50:54,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1566 transitions. [2023-11-23 08:50:54,793 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1566 transitions. Word has length 80 [2023-11-23 08:50:54,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:54,794 INFO L495 AbstractCegarLoop]: Abstraction has 1114 states and 1566 transitions. [2023-11-23 08:50:54,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:50:54,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1566 transitions. [2023-11-23 08:50:54,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 08:50:54,799 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:54,799 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 08:50:54,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-23 08:50:55,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-23 08:50:55,012 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:55,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:55,013 INFO L85 PathProgramCache]: Analyzing trace with hash -301613094, now seen corresponding path program 1 times [2023-11-23 08:50:55,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:55,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357786844] [2023-11-23 08:50:55,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:55,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:50:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:50:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:50:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:50:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:50:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:50:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:50:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,164 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-23 08:50:55,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:55,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357786844] [2023-11-23 08:50:55,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357786844] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:55,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242711044] [2023-11-23 08:50:55,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:55,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:55,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:55,167 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:50:55,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-23 08:50:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 08:50:55,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-23 08:50:55,348 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:50:55,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242711044] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:50:55,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:50:55,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-23 08:50:55,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376245849] [2023-11-23 08:50:55,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:50:55,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:50:55,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:55,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:50:55,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:50:55,350 INFO L87 Difference]: Start difference. First operand 1114 states and 1566 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:50:55,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:55,447 INFO L93 Difference]: Finished difference Result 1494 states and 2083 transitions. [2023-11-23 08:50:55,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:50:55,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2023-11-23 08:50:55,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:55,450 INFO L225 Difference]: With dead ends: 1494 [2023-11-23 08:50:55,450 INFO L226 Difference]: Without dead ends: 392 [2023-11-23 08:50:55,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:50:55,455 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 3 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:55,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 194 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:50:55,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-23 08:50:55,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 382. [2023-11-23 08:50:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 291 states have (on average 1.2474226804123711) internal successors, (363), 301 states have internal predecessors, (363), 56 states have call successors, (56), 26 states have call predecessors, (56), 34 states have return successors, (68), 54 states have call predecessors, (68), 52 states have call successors, (68) [2023-11-23 08:50:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 487 transitions. [2023-11-23 08:50:55,506 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 487 transitions. Word has length 80 [2023-11-23 08:50:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:55,506 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 487 transitions. [2023-11-23 08:50:55,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:50:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 487 transitions. [2023-11-23 08:50:55,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-23 08:50:55,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:55,508 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 08:50:55,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-23 08:50:55,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-23 08:50:55,724 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:55,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:55,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1611016499, now seen corresponding path program 1 times [2023-11-23 08:50:55,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:55,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521842425] [2023-11-23 08:50:55,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:55,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:50:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:50:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:50:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 08:50:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:50:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:50:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 08:50:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:56,004 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-23 08:50:56,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:56,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521842425] [2023-11-23 08:50:56,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521842425] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:56,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816498292] [2023-11-23 08:50:56,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:56,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:56,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:56,007 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:50:56,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-23 08:50:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:56,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-23 08:50:56,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:56,243 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 18 treesize of output 19 [2023-11-23 08:50:56,253 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 18 treesize of output 19 [2023-11-23 08:50:56,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:56,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:56,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-23 08:50:56,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:56,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:56,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-23 08:50:56,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:56,321 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 27 treesize of output 20 [2023-11-23 08:50:56,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:56,330 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 27 treesize of output 20 [2023-11-23 08:50:56,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:56,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:56,377 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 47 treesize of output 42 [2023-11-23 08:50:56,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2023-11-23 08:50:56,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:56,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 25 [2023-11-23 08:50:57,535 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-23 08:50:57,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:50:57,857 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 16))) (and (forall ((v_ArrVal_936 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_936))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_937 Int)) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_937)))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2023-11-23 08:50:57,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:50:57,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2023-11-23 08:50:57,903 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 16))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| Int)) (or (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_17| Int) (v_arrayElimArr_7 (Array Int Int)) (v_subst_1 Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_17|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| v_arrayElimArr_7))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_1))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| Int)) (or (forall ((v_ArrVal_936 (Array Int Int)) (v_ArrVal_932 Int)) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_932)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| v_ArrVal_936))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| 1)))))) is different from false [2023-11-23 08:50:57,928 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:50:57,929 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:50:58,003 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 08:50:58,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 297 treesize of output 284 [2023-11-23 08:50:58,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:50:58,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 228 [2023-11-23 08:50:58,034 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 187 treesize of output 175 [2023-11-23 08:50:58,046 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:50:58,047 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:50:58,120 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 08:50:58,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 373 treesize of output 360 [2023-11-23 08:50:58,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:50:58,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 306 treesize of output 304 [2023-11-23 08:50:58,174 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 263 treesize of output 251 [2023-11-23 08:50:58,231 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 8 treesize of output 4 [2023-11-23 08:50:58,759 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 7 treesize of output 3 [2023-11-23 08:50:58,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:50:58,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 87 [2023-11-23 08:50:58,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:50:58,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 102 [2023-11-23 08:50:58,923 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 1 not checked. [2023-11-23 08:50:58,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816498292] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:50:58,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:50:58,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 23 [2023-11-23 08:50:58,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021738598] [2023-11-23 08:50:58,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:50:58,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-23 08:50:58,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:58,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-23 08:50:58,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=364, Unknown=2, NotChecked=78, Total=506 [2023-11-23 08:50:58,926 INFO L87 Difference]: Start difference. First operand 382 states and 487 transitions. Second operand has 23 states, 22 states have (on average 4.7727272727272725) internal successors, (105), 22 states have internal predecessors, (105), 10 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2023-11-23 08:51:00,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:51:00,199 INFO L93 Difference]: Finished difference Result 596 states and 772 transitions. [2023-11-23 08:51:00,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-23 08:51:00,200 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.7727272727272725) internal successors, (105), 22 states have internal predecessors, (105), 10 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) Word has length 81 [2023-11-23 08:51:00,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:51:00,202 INFO L225 Difference]: With dead ends: 596 [2023-11-23 08:51:00,202 INFO L226 Difference]: Without dead ends: 390 [2023-11-23 08:51:00,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 155 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=149, Invalid=979, Unknown=2, NotChecked=130, Total=1260 [2023-11-23 08:51:00,204 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 77 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 281 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 08:51:00,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 906 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 738 Invalid, 0 Unknown, 281 Unchecked, 0.8s Time] [2023-11-23 08:51:00,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2023-11-23 08:51:00,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 388. [2023-11-23 08:51:00,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 294 states have (on average 1.2346938775510203) internal successors, (363), 307 states have internal predecessors, (363), 56 states have call successors, (56), 26 states have call predecessors, (56), 37 states have return successors, (74), 54 states have call predecessors, (74), 52 states have call successors, (74) [2023-11-23 08:51:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 493 transitions. [2023-11-23 08:51:00,301 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 493 transitions. Word has length 81 [2023-11-23 08:51:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:51:00,301 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 493 transitions. [2023-11-23 08:51:00,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.7727272727272725) internal successors, (105), 22 states have internal predecessors, (105), 10 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2023-11-23 08:51:00,302 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 493 transitions. [2023-11-23 08:51:00,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-23 08:51:00,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:51:00,303 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 08:51:00,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-23 08:51:00,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-23 08:51:00,522 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:51:00,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:51:00,523 INFO L85 PathProgramCache]: Analyzing trace with hash 557154695, now seen corresponding path program 1 times [2023-11-23 08:51:00,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:51:00,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249837849] [2023-11-23 08:51:00,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:51:00,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:51:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:00,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:51:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:00,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:51:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:00,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:51:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:00,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:51:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:00,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 08:51:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:00,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:51:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:00,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 08:51:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:00,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 08:51:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:00,962 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-23 08:51:00,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:51:00,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249837849] [2023-11-23 08:51:00,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249837849] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:51:00,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812423627] [2023-11-23 08:51:00,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:51:00,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:51:00,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:51:00,965 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:51:00,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-23 08:51:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:01,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 08:51:01,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:51:01,282 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-23 08:51:01,283 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:51:01,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812423627] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:51:01,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:51:01,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2023-11-23 08:51:01,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424758433] [2023-11-23 08:51:01,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:51:01,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:51:01,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:51:01,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:51:01,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2023-11-23 08:51:01,285 INFO L87 Difference]: Start difference. First operand 388 states and 493 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:51:01,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:51:01,462 INFO L93 Difference]: Finished difference Result 653 states and 831 transitions. [2023-11-23 08:51:01,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:51:01,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 83 [2023-11-23 08:51:01,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:51:01,465 INFO L225 Difference]: With dead ends: 653 [2023-11-23 08:51:01,465 INFO L226 Difference]: Without dead ends: 382 [2023-11-23 08:51:01,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2023-11-23 08:51:01,468 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 33 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:51:01,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 271 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:51:01,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2023-11-23 08:51:01,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2023-11-23 08:51:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 290 states have (on average 1.203448275862069) internal successors, (349), 301 states have internal predecessors, (349), 56 states have call successors, (56), 26 states have call predecessors, (56), 35 states have return successors, (70), 54 states have call predecessors, (70), 52 states have call successors, (70) [2023-11-23 08:51:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 475 transitions. [2023-11-23 08:51:01,525 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 475 transitions. Word has length 83 [2023-11-23 08:51:01,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:51:01,525 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 475 transitions. [2023-11-23 08:51:01,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:51:01,526 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 475 transitions. [2023-11-23 08:51:01,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-23 08:51:01,528 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:51:01,528 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:51:01,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-23 08:51:01,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:51:01,746 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:51:01,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:51:01,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1347639768, now seen corresponding path program 1 times [2023-11-23 08:51:01,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:51:01,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712802940] [2023-11-23 08:51:01,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:51:01,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:51:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:01,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:51:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:01,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:51:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:01,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:51:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:01,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:51:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:01,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 08:51:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:01,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:51:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:01,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:51:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:01,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 08:51:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:02,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 08:51:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-11-23 08:51:02,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:51:02,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712802940] [2023-11-23 08:51:02,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712802940] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:51:02,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013397646] [2023-11-23 08:51:02,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:51:02,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:51:02,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:51:02,034 INFO L229 MonitoredProcess]: Starting monitored process 16 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:51:02,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-23 08:51:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:02,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 143 conjunts are in the unsatisfiable core [2023-11-23 08:51:02,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:51:02,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:51:02,364 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 27 treesize of output 15 [2023-11-23 08:51:02,373 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-23 08:51:02,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:51:02,379 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 16 treesize of output 11 [2023-11-23 08:51:02,462 INFO L349 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2023-11-23 08:51:02,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 160 treesize of output 156 [2023-11-23 08:51:02,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 112 [2023-11-23 08:51:02,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:51:02,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:51:02,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 25 [2023-11-23 08:51:03,809 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:51:03,809 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:51:04,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:51:04,799 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2023-11-23 08:51:04,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:51:04,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 416 treesize of output 370 [2023-11-23 08:51:04,829 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 192 treesize of output 184 [2023-11-23 08:51:04,936 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 6 treesize of output 4 [2023-11-23 08:51:04,948 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 26 treesize of output 24 [2023-11-23 08:51:04,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:51:04,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 75 [2023-11-23 08:51:05,132 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:51:05,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013397646] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:51:05,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:51:05,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17, 17] total 37 [2023-11-23 08:51:05,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81684311] [2023-11-23 08:51:05,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:51:05,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-23 08:51:05,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:51:05,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-23 08:51:05,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1188, Unknown=18, NotChecked=0, Total=1332 [2023-11-23 08:51:05,135 INFO L87 Difference]: Start difference. First operand 382 states and 475 transitions. Second operand has 37 states, 32 states have (on average 4.0) internal successors, (128), 33 states have internal predecessors, (128), 10 states have call successors, (25), 3 states have call predecessors, (25), 8 states have return successors, (24), 8 states have call predecessors, (24), 10 states have call successors, (24) [2023-11-23 08:51:08,292 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:51:10,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:51:13,338 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:51:15,348 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:51:17,679 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:51:20,009 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:51:22,412 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:51:24,508 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:51:24,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:51:24,509 INFO L93 Difference]: Finished difference Result 701 states and 906 transitions. [2023-11-23 08:51:24,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-23 08:51:24,510 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 32 states have (on average 4.0) internal successors, (128), 33 states have internal predecessors, (128), 10 states have call successors, (25), 3 states have call predecessors, (25), 8 states have return successors, (24), 8 states have call predecessors, (24), 10 states have call successors, (24) Word has length 93 [2023-11-23 08:51:24,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:51:24,512 INFO L225 Difference]: With dead ends: 701 [2023-11-23 08:51:24,512 INFO L226 Difference]: Without dead ends: 428 [2023-11-23 08:51:24,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=429, Invalid=3710, Unknown=21, NotChecked=0, Total=4160 [2023-11-23 08:51:24,515 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 120 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 21 mSolverCounterUnsat, 42 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 2445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 42 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:51:24,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1615 Invalid, 2445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2382 Invalid, 42 Unknown, 0 Unchecked, 18.2s Time] [2023-11-23 08:51:24,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2023-11-23 08:51:24,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 343. [2023-11-23 08:51:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 264 states have (on average 1.2007575757575757) internal successors, (317), 274 states have internal predecessors, (317), 47 states have call successors, (47), 25 states have call predecessors, (47), 31 states have return successors, (60), 43 states have call predecessors, (60), 43 states have call successors, (60) [2023-11-23 08:51:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 424 transitions. [2023-11-23 08:51:24,608 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 424 transitions. Word has length 93 [2023-11-23 08:51:24,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:51:24,608 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 424 transitions. [2023-11-23 08:51:24,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 32 states have (on average 4.0) internal successors, (128), 33 states have internal predecessors, (128), 10 states have call successors, (25), 3 states have call predecessors, (25), 8 states have return successors, (24), 8 states have call predecessors, (24), 10 states have call successors, (24) [2023-11-23 08:51:24,609 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 424 transitions. [2023-11-23 08:51:24,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-23 08:51:24,610 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:51:24,610 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 08:51:24,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-23 08:51:24,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-23 08:51:24,829 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:51:24,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:51:24,830 INFO L85 PathProgramCache]: Analyzing trace with hash -297256987, now seen corresponding path program 1 times [2023-11-23 08:51:24,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:51:24,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088503193] [2023-11-23 08:51:24,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:51:24,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:51:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:26,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:51:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:26,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:51:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:26,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:51:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:26,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:51:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:26,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:51:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:26,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:51:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:26,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:51:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:26,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 08:51:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:26,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:51:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:26,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:51:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-23 08:51:26,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:51:26,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088503193] [2023-11-23 08:51:26,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088503193] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:51:26,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70997837] [2023-11-23 08:51:26,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:51:26,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:51:26,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:51:26,813 INFO L229 MonitoredProcess]: Starting monitored process 17 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:51:26,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-23 08:51:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:51:27,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 128 conjunts are in the unsatisfiable core [2023-11-23 08:51:27,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:51:27,128 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:51:27,131 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 18 treesize of output 7 [2023-11-23 08:51:27,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-23 08:51:27,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 36 treesize of output 17 [2023-11-23 08:51:27,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:51:27,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2023-11-23 08:51:29,900 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 71 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:51:29,900 INFO L327 TraceCheckSpWp]: Computing backward predicates... Killed by 15