./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_insert_before_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_insert_before_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 2f0ef11561022276ce844351f7c3da39e7886059141883b3ddc06067a22b3d7d --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:49:24,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:49:24,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 08:49:24,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:49:24,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:49:24,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:49:24,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:49:24,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:49:24,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:49:24,318 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:49:24,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:49:24,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:49:24,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:49:24,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:49:24,321 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:49:24,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:49:24,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:49:24,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:49:24,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:49:24,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:49:24,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:49:24,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:49:24,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:49:24,323 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:49:24,323 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:49:24,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:49:24,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:49:24,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:49:24,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:49:24,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:49:24,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:49:24,325 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:49:24,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:49:24,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:49:24,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:49:24,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:49:24,326 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:49:24,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:49:24,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:49:24,327 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 -> 2f0ef11561022276ce844351f7c3da39e7886059141883b3ddc06067a22b3d7d Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:49:24,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:49:24,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:49:24,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:49:24,588 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:49:24,588 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:49:24,589 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_insert_before_harness.i [2023-11-23 08:49:25,693 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:49:26,022 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:49:26,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_insert_before_harness.i [2023-11-23 08:49:26,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178a12887/a83de86a961a4432ad90afd0a2b7e8e8/FLAGe2c9aad57 [2023-11-23 08:49:26,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178a12887/a83de86a961a4432ad90afd0a2b7e8e8 [2023-11-23 08:49:26,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:49:26,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:49:26,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:49:26,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:49:26,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:49:26,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:49:26" (1/1) ... [2023-11-23 08:49:26,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cbba660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:26, skipping insertion in model container [2023-11-23 08:49:26,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:49:26" (1/1) ... [2023-11-23 08:49:26,160 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:49:26,323 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_insert_before_harness.i[4503,4516] [2023-11-23 08:49:26,331 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_insert_before_harness.i[4563,4576] [2023-11-23 08:49:26,819 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:26,820 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:26,820 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:26,821 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:26,821 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:26,829 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:26,830 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:26,833 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:26,834 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:26,840 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:26,841 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:26,843 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:26,844 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:27,036 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:49:27,038 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:49:27,040 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:49:27,041 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:49:27,041 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:49:27,042 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:49:27,043 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:49:27,043 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:49:27,044 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:49:27,044 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:49:27,163 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:49:27,176 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:49:27,193 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_insert_before_harness.i[4503,4516] [2023-11-23 08:49:27,194 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_insert_before_harness.i[4563,4576] [2023-11-23 08:49:27,221 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:27,221 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:27,222 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:27,222 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:27,222 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:27,228 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:27,229 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:27,229 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:27,230 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:27,230 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:27,231 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:27,231 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:27,231 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:27,255 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:49:27,256 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:49:27,256 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:49:27,257 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:49:27,257 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:49:27,258 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:49:27,258 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:49:27,258 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:49:27,259 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:49:27,259 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:49:27,277 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:49:27,407 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:27,407 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:27,407 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:27,407 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:27,407 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:27,407 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:27,408 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:27,408 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:27,408 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:27,408 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:27,408 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:27,408 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:27,408 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:27,409 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:27,409 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:27,414 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:49:27,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:27 WrapperNode [2023-11-23 08:49:27,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:49:27,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:49:27,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:49:27,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:49:27,451 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:49:27" (1/1) ... [2023-11-23 08:49:27,521 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:49:27" (1/1) ... [2023-11-23 08:49:27,555 INFO L138 Inliner]: procedures = 678, calls = 1048, calls flagged for inlining = 49, calls inlined = 3, statements flattened = 50 [2023-11-23 08:49:27,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:49:27,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:49:27,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:49:27,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:49:27,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:27" (1/1) ... [2023-11-23 08:49:27,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:27" (1/1) ... [2023-11-23 08:49:27,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:27" (1/1) ... [2023-11-23 08:49:27,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:27" (1/1) ... [2023-11-23 08:49:27,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:27" (1/1) ... [2023-11-23 08:49:27,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:27" (1/1) ... [2023-11-23 08:49:27,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:27" (1/1) ... [2023-11-23 08:49:27,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:27" (1/1) ... [2023-11-23 08:49:27,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:49:27,623 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:49:27,623 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:49:27,623 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:49:27,624 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:27" (1/1) ... [2023-11-23 08:49:27,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:49:27,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:49:27,653 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:49:27,671 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:49:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:49:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:49:27,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:49:27,698 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:49:27,698 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:49:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:49:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:49:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_insert_before [2023-11-23 08:49:27,699 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_insert_before [2023-11-23 08:49:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:49:27,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:49:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:49:27,700 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:49:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:49:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:49:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:49:27,701 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:49:27,701 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:49:27,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:49:27,864 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:49:27,866 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:49:28,014 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:49:28,049 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:49:28,049 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 08:49:28,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:49:28 BoogieIcfgContainer [2023-11-23 08:49:28,050 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:49:28,051 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:49:28,051 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:49:28,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:49:28,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:49:26" (1/3) ... [2023-11-23 08:49:28,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4f5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:49:28, skipping insertion in model container [2023-11-23 08:49:28,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:27" (2/3) ... [2023-11-23 08:49:28,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4f5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:49:28, skipping insertion in model container [2023-11-23 08:49:28,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:49:28" (3/3) ... [2023-11-23 08:49:28,056 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_insert_before_harness.i [2023-11-23 08:49:28,069 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:49:28,069 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:49:28,100 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:49:28,105 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;@d9ac1e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:49:28,106 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:49:28,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-23 08:49:28,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 08:49:28,115 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:28,115 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:49:28,115 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:28,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:28,120 INFO L85 PathProgramCache]: Analyzing trace with hash -669486050, now seen corresponding path program 1 times [2023-11-23 08:49:28,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:28,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609316416] [2023-11-23 08:49:28,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:28,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:28,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 08:49:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:28,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:49:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:28,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:49:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:28,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:49:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:28,551 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 08:49:28,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:28,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609316416] [2023-11-23 08:49:28,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609316416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:49:28,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:49:28,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 08:49:28,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175012618] [2023-11-23 08:49:28,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:49:28,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 08:49:28,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:28,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 08:49:28,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:49:28,589 INFO L87 Difference]: Start difference. First operand has 59 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 08:49:28,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:49:28,626 INFO L93 Difference]: Finished difference Result 113 states and 165 transitions. [2023-11-23 08:49:28,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 08:49:28,628 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2023-11-23 08:49:28,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:49:28,635 INFO L225 Difference]: With dead ends: 113 [2023-11-23 08:49:28,636 INFO L226 Difference]: Without dead ends: 57 [2023-11-23 08:49:28,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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:49:28,646 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:49:28,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:49:28,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-23 08:49:28,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-23 08:49:28,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-23 08:49:28,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2023-11-23 08:49:28,695 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 33 [2023-11-23 08:49:28,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:49:28,697 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2023-11-23 08:49:28,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 08:49:28,698 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2023-11-23 08:49:28,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 08:49:28,699 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:28,700 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:49:28,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 08:49:28,704 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:28,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:28,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1526647902, now seen corresponding path program 1 times [2023-11-23 08:49:28,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:28,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605858127] [2023-11-23 08:49:28,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:28,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:30,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 08:49:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:30,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:49:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:30,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:49:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:30,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:49:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 08:49:30,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:30,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605858127] [2023-11-23 08:49:30,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605858127] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:49:30,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:49:30,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-23 08:49:30,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412418292] [2023-11-23 08:49:30,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:49:30,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 08:49:30,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:30,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 08:49:30,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:49:30,307 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand has 12 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 08:49:30,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:49:30,665 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2023-11-23 08:49:30,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 08:49:30,666 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2023-11-23 08:49:30,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:49:30,668 INFO L225 Difference]: With dead ends: 67 [2023-11-23 08:49:30,668 INFO L226 Difference]: Without dead ends: 65 [2023-11-23 08:49:30,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:49:30,669 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 17 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:49:30,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 486 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:49:30,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-23 08:49:30,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2023-11-23 08:49:30,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 36 states have internal predecessors, (39), 22 states have call successors, (22), 6 states have call predecessors, (22), 7 states have return successors, (26), 21 states have call predecessors, (26), 21 states have call successors, (26) [2023-11-23 08:49:30,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2023-11-23 08:49:30,679 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 33 [2023-11-23 08:49:30,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:49:30,680 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2023-11-23 08:49:30,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 08:49:30,680 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2023-11-23 08:49:30,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 08:49:30,681 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:30,681 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:49:30,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 08:49:30,681 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:30,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:30,682 INFO L85 PathProgramCache]: Analyzing trace with hash 248359460, now seen corresponding path program 1 times [2023-11-23 08:49:30,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:30,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695770023] [2023-11-23 08:49:30,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:30,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:30,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 08:49:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:30,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:49:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:30,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:49:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:30,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:49:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 08:49:31,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:31,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695770023] [2023-11-23 08:49:31,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695770023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:49:31,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:49:31,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 08:49:31,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929472747] [2023-11-23 08:49:31,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:49:31,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:49:31,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:31,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:49:31,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:49:31,074 INFO L87 Difference]: Start difference. First operand 64 states and 87 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 08:49:31,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:49:31,351 INFO L93 Difference]: Finished difference Result 115 states and 161 transitions. [2023-11-23 08:49:31,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:49:31,352 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2023-11-23 08:49:31,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:49:31,355 INFO L225 Difference]: With dead ends: 115 [2023-11-23 08:49:31,355 INFO L226 Difference]: Without dead ends: 69 [2023-11-23 08:49:31,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:49:31,361 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 33 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:49:31,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 414 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:49:31,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-23 08:49:31,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2023-11-23 08:49:31,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 22 states have call successors, (22), 6 states have call predecessors, (22), 8 states have return successors, (30), 21 states have call predecessors, (30), 21 states have call successors, (30) [2023-11-23 08:49:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2023-11-23 08:49:31,381 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 33 [2023-11-23 08:49:31,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:49:31,382 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2023-11-23 08:49:31,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 08:49:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2023-11-23 08:49:31,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 08:49:31,384 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:31,384 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:49:31,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 08:49:31,384 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:31,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:31,385 INFO L85 PathProgramCache]: Analyzing trace with hash 928417830, now seen corresponding path program 1 times [2023-11-23 08:49:31,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:31,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130710120] [2023-11-23 08:49:31,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:31,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:31,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 08:49:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:31,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:49:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:31,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:49:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:31,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:49:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:31,540 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 08:49:31,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:31,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130710120] [2023-11-23 08:49:31,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130710120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:49:31,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:49:31,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 08:49:31,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682502430] [2023-11-23 08:49:31,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:49:31,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:49:31,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:31,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:49:31,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:49:31,543 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 08:49:31,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:49:31,655 INFO L93 Difference]: Finished difference Result 133 states and 187 transitions. [2023-11-23 08:49:31,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:49:31,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2023-11-23 08:49:31,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:49:31,658 INFO L225 Difference]: With dead ends: 133 [2023-11-23 08:49:31,658 INFO L226 Difference]: Without dead ends: 69 [2023-11-23 08:49:31,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:49:31,660 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 18 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:49:31,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 290 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:49:31,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-23 08:49:31,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2023-11-23 08:49:31,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 21 states have call successors, (21), 6 states have call predecessors, (21), 8 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2023-11-23 08:49:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 90 transitions. [2023-11-23 08:49:31,682 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 90 transitions. Word has length 33 [2023-11-23 08:49:31,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:49:31,682 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 90 transitions. [2023-11-23 08:49:31,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 08:49:31,682 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2023-11-23 08:49:31,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-23 08:49:31,683 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:31,683 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:49:31,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 08:49:31,684 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:31,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:31,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2092129131, now seen corresponding path program 1 times [2023-11-23 08:49:31,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:31,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419209650] [2023-11-23 08:49:31,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:31,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:32,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 08:49:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:32,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:49:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:32,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:49:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:32,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:49:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:32,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:49:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:32,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:49:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:32,972 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 08:49:32,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:32,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419209650] [2023-11-23 08:49:32,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419209650] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:49:32,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:49:32,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-23 08:49:32,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230003763] [2023-11-23 08:49:32,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:49:32,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 08:49:32,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:32,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 08:49:32,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:49:32,974 INFO L87 Difference]: Start difference. First operand 67 states and 90 transitions. Second operand has 13 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 08:49:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:49:33,363 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2023-11-23 08:49:33,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 08:49:33,363 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2023-11-23 08:49:33,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:49:33,366 INFO L225 Difference]: With dead ends: 77 [2023-11-23 08:49:33,366 INFO L226 Difference]: Without dead ends: 75 [2023-11-23 08:49:33,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2023-11-23 08:49:33,368 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 17 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:49:33,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 551 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:49:33,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-23 08:49:33,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2023-11-23 08:49:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 41 states have (on average 1.146341463414634) internal successors, (47), 45 states have internal predecessors, (47), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (29), 21 states have call predecessors, (29), 21 states have call successors, (29) [2023-11-23 08:49:33,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2023-11-23 08:49:33,386 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 98 transitions. Word has length 46 [2023-11-23 08:49:33,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:49:33,387 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 98 transitions. [2023-11-23 08:49:33,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 08:49:33,388 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2023-11-23 08:49:33,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-23 08:49:33,392 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:33,392 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:49:33,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 08:49:33,392 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:33,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:33,393 INFO L85 PathProgramCache]: Analyzing trace with hash -427830803, now seen corresponding path program 1 times [2023-11-23 08:49:33,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:33,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250333749] [2023-11-23 08:49:33,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:33,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:34,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 08:49:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:34,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:49:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:34,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:49:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:34,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:49:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:34,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:49:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:34,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:49:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:34,579 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-23 08:49:34,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:34,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250333749] [2023-11-23 08:49:34,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250333749] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:49:34,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198835771] [2023-11-23 08:49:34,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:34,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:49:34,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:49:34,582 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:49:34,608 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:49:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:34,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-23 08:49:34,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:49:34,824 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 08:49:34,825 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 45 treesize of output 41 [2023-11-23 08:49:34,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-23 08:49:34,849 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 08:49:34,849 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 37 [2023-11-23 08:49:47,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:49:47,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 54 [2023-11-23 08:49:47,409 INFO L349 Elim1Store]: treesize reduction 137, result has 10.5 percent of original size [2023-11-23 08:49:47,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 178 treesize of output 140 [2023-11-23 08:49:47,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 81 [2023-11-23 08:49:49,583 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 6 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:49:49,584 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:49:49,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198835771] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:49:49,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:49:49,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2023-11-23 08:49:49,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057648350] [2023-11-23 08:49:49,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:49:49,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-23 08:49:49,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:49,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-23 08:49:49,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=887, Unknown=56, NotChecked=0, Total=1056 [2023-11-23 08:49:49,907 INFO L87 Difference]: Start difference. First operand 74 states and 98 transitions. Second operand has 27 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 23 states have internal predecessors, (54), 11 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (12), 6 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-23 08:49:55,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:49:55,131 INFO L93 Difference]: Finished difference Result 172 states and 216 transitions. [2023-11-23 08:49:55,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-23 08:49:55,131 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 23 states have internal predecessors, (54), 11 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (12), 6 states have call predecessors, (12), 8 states have call successors, (12) Word has length 46 [2023-11-23 08:49:55,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:49:55,132 INFO L225 Difference]: With dead ends: 172 [2023-11-23 08:49:55,132 INFO L226 Difference]: Without dead ends: 92 [2023-11-23 08:49:55,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=304, Invalid=2137, Unknown=109, NotChecked=0, Total=2550 [2023-11-23 08:49:55,133 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 94 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 23 mSolverCounterUnsat, 252 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 252 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-23 08:49:55,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 494 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1193 Invalid, 252 Unknown, 0 Unchecked, 3.7s Time] [2023-11-23 08:49:55,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-23 08:49:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2023-11-23 08:49:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.150943396226415) internal successors, (61), 57 states have internal predecessors, (61), 22 states have call successors, (22), 9 states have call predecessors, (22), 12 states have return successors, (25), 21 states have call predecessors, (25), 21 states have call successors, (25) [2023-11-23 08:49:55,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2023-11-23 08:49:55,142 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 46 [2023-11-23 08:49:55,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:49:55,143 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2023-11-23 08:49:55,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 23 states have internal predecessors, (54), 11 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (12), 6 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-23 08:49:55,143 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2023-11-23 08:49:55,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-23 08:49:55,143 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:55,143 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:49:55,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-23 08:49:55,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-23 08:49:55,356 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:55,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:55,356 INFO L85 PathProgramCache]: Analyzing trace with hash 252227567, now seen corresponding path program 1 times [2023-11-23 08:49:55,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:55,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743575852] [2023-11-23 08:49:55,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:55,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:55,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 08:49:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:55,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:49:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:55,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:49:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:55,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:49:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:55,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:49:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:55,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:49:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 08:49:55,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:55,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743575852] [2023-11-23 08:49:55,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743575852] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:49:55,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:49:55,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 08:49:55,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416448787] [2023-11-23 08:49:55,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:49:55,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:49:55,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:55,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:49:55,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:49:55,513 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-23 08:49:55,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:49:55,590 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2023-11-23 08:49:55,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:49:55,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2023-11-23 08:49:55,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:49:55,593 INFO L225 Difference]: With dead ends: 141 [2023-11-23 08:49:55,593 INFO L226 Difference]: Without dead ends: 79 [2023-11-23 08:49:55,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:49:55,594 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 17 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:49:55,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 297 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:49:55,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-23 08:49:55,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-23 08:49:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 49 states have internal predecessors, (51), 21 states have call successors, (21), 9 states have call predecessors, (21), 10 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2023-11-23 08:49:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2023-11-23 08:49:55,604 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 46 [2023-11-23 08:49:55,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:49:55,604 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2023-11-23 08:49:55,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-23 08:49:55,604 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2023-11-23 08:49:55,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-23 08:49:55,605 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:55,605 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:49:55,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 08:49:55,606 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:55,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:55,606 INFO L85 PathProgramCache]: Analyzing trace with hash 620792392, now seen corresponding path program 1 times [2023-11-23 08:49:55,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:55,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831978765] [2023-11-23 08:49:55,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:55,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:56,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 08:49:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:56,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:49:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:56,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:49:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:56,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:49:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:56,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:49:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:56,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:49:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:56,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:49:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:56,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:49:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-23 08:49:56,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:56,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831978765] [2023-11-23 08:49:56,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831978765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:49:56,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:49:56,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-23 08:49:56,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252923478] [2023-11-23 08:49:56,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:49:56,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 08:49:56,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:56,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 08:49:56,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:49:56,729 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand has 13 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-23 08:49:57,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:49:57,055 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2023-11-23 08:49:57,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 08:49:57,055 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 59 [2023-11-23 08:49:57,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:49:57,056 INFO L225 Difference]: With dead ends: 89 [2023-11-23 08:49:57,056 INFO L226 Difference]: Without dead ends: 87 [2023-11-23 08:49:57,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2023-11-23 08:49:57,057 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 20 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:49:57,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 515 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:49:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-23 08:49:57,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2023-11-23 08:49:57,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 54 states have internal predecessors, (55), 22 states have call successors, (22), 10 states have call predecessors, (22), 12 states have return successors, (26), 21 states have call predecessors, (26), 21 states have call successors, (26) [2023-11-23 08:49:57,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2023-11-23 08:49:57,066 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 59 [2023-11-23 08:49:57,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:49:57,066 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2023-11-23 08:49:57,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-23 08:49:57,066 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2023-11-23 08:49:57,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-23 08:49:57,067 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:57,067 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:49:57,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 08:49:57,067 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:57,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:57,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1899167542, now seen corresponding path program 1 times [2023-11-23 08:49:57,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:57,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221869297] [2023-11-23 08:49:57,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:57,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:57,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 08:49:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:57,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:49:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:57,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:49:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:57,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:49:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:57,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:49:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:57,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:49:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:57,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:49:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:57,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:49:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:57,616 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 08:49:57,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:57,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221869297] [2023-11-23 08:49:57,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221869297] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:49:57,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:49:57,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-23 08:49:57,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54006502] [2023-11-23 08:49:57,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:49:57,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 08:49:57,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:57,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 08:49:57,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:49:57,618 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:49:58,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:49:58,000 INFO L93 Difference]: Finished difference Result 135 states and 168 transitions. [2023-11-23 08:49:58,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 08:49:58,000 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 59 [2023-11-23 08:49:58,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:49:58,001 INFO L225 Difference]: With dead ends: 135 [2023-11-23 08:49:58,001 INFO L226 Difference]: Without dead ends: 93 [2023-11-23 08:49:58,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-11-23 08:49:58,002 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 38 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:49:58,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 454 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:49:58,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-23 08:49:58,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2023-11-23 08:49:58,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 58 states have internal predecessors, (59), 22 states have call successors, (22), 10 states have call predecessors, (22), 13 states have return successors, (28), 21 states have call predecessors, (28), 21 states have call successors, (28) [2023-11-23 08:49:58,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2023-11-23 08:49:58,011 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 59 [2023-11-23 08:49:58,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:49:58,011 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2023-11-23 08:49:58,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:49:58,011 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2023-11-23 08:49:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-23 08:49:58,012 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:58,012 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:49:58,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 08:49:58,012 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:58,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:58,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1219109172, now seen corresponding path program 1 times [2023-11-23 08:49:58,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:58,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860845294] [2023-11-23 08:49:58,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:58,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:58,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 08:49:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:58,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:49:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:58,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:49:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:58,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:49:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:58,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:49:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:58,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:49:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:58,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:49:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:58,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:49:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 08:49:58,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:58,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860845294] [2023-11-23 08:49:58,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860845294] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:49:58,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:49:58,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 08:49:58,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940757665] [2023-11-23 08:49:58,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:49:58,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:49:58,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:58,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:49:58,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:49:58,232 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:49:58,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:49:58,381 INFO L93 Difference]: Finished difference Result 142 states and 177 transitions. [2023-11-23 08:49:58,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:49:58,381 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 59 [2023-11-23 08:49:58,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:49:58,382 INFO L225 Difference]: With dead ends: 142 [2023-11-23 08:49:58,382 INFO L226 Difference]: Without dead ends: 91 [2023-11-23 08:49:58,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:49:58,383 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 20 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:49:58,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 437 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:49:58,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-23 08:49:58,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2023-11-23 08:49:58,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 56 states have internal predecessors, (58), 21 states have call successors, (21), 10 states have call predecessors, (21), 12 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2023-11-23 08:49:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2023-11-23 08:49:58,391 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 59 [2023-11-23 08:49:58,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:49:58,392 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2023-11-23 08:49:58,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:49:58,392 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2023-11-23 08:49:58,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:49:58,392 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:58,392 INFO L195 NwaCegarLoop]: trace histogram [4, 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:49:58,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 08:49:58,393 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:58,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:58,393 INFO L85 PathProgramCache]: Analyzing trace with hash -929607402, now seen corresponding path program 1 times [2023-11-23 08:49:58,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:58,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131981240] [2023-11-23 08:49:58,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:58,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:58,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 08:49:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:58,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:49:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:58,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:49:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:58,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:49:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:58,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:49:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:58,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:49:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:58,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:49:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:58,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:49:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:58,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:49:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:58,737 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-23 08:49:58,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:58,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131981240] [2023-11-23 08:49:58,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131981240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:49:58,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:49:58,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 08:49:58,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001013940] [2023-11-23 08:49:58,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:49:58,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:49:58,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:58,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:49:58,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:49:58,740 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 08:49:58,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:49:58,848 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2023-11-23 08:49:58,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:49:58,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2023-11-23 08:49:58,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:49:58,849 INFO L225 Difference]: With dead ends: 93 [2023-11-23 08:49:58,849 INFO L226 Difference]: Without dead ends: 91 [2023-11-23 08:49:58,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:49:58,850 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 7 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:49:58,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 302 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:49:58,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-23 08:49:58,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-11-23 08:49:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 59 states have internal predecessors, (61), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2023-11-23 08:49:58,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2023-11-23 08:49:58,858 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 65 [2023-11-23 08:49:58,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:49:58,858 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2023-11-23 08:49:58,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 08:49:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2023-11-23 08:49:58,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 08:49:58,859 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:58,859 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 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] [2023-11-23 08:49:58,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 08:49:58,859 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:58,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:58,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1890293950, now seen corresponding path program 1 times [2023-11-23 08:49:58,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:58,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360422647] [2023-11-23 08:49:58,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:58,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:59,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:49:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:00,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:00,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:50:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:00,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:50:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:00,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:50:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:00,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:50:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:00,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 08:50:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:00,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:50:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:00,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:50:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:00,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:50:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:00,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:50:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:00,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 08:50:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:00,848 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-23 08:50:00,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:00,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360422647] [2023-11-23 08:50:00,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360422647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:50:00,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:50:00,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-23 08:50:00,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563229038] [2023-11-23 08:50:00,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:50:00,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-23 08:50:00,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:00,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-23 08:50:00,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2023-11-23 08:50:00,850 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand has 16 states, 10 states have (on average 3.2) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2023-11-23 08:50:01,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:01,593 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2023-11-23 08:50:01,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 08:50:01,593 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 10 states have (on average 3.2) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Word has length 79 [2023-11-23 08:50:01,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:01,595 INFO L225 Difference]: With dead ends: 99 [2023-11-23 08:50:01,595 INFO L226 Difference]: Without dead ends: 97 [2023-11-23 08:50:01,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2023-11-23 08:50:01,596 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 44 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:01,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 163 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 08:50:01,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-23 08:50:01,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2023-11-23 08:50:01,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 62 states have internal predecessors, (64), 22 states have call successors, (22), 12 states have call predecessors, (22), 14 states have return successors, (25), 21 states have call predecessors, (25), 21 states have call successors, (25) [2023-11-23 08:50:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2023-11-23 08:50:01,615 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 79 [2023-11-23 08:50:01,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:01,615 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2023-11-23 08:50:01,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 10 states have (on average 3.2) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2023-11-23 08:50:01,616 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2023-11-23 08:50:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 08:50:01,619 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:01,619 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:50:01,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 08:50:01,620 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:01,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:01,620 INFO L85 PathProgramCache]: Analyzing trace with hash -115286588, now seen corresponding path program 1 times [2023-11-23 08:50:01,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:01,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331355141] [2023-11-23 08:50:01,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:01,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:01,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:02,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:02,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:50:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:02,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:50:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:02,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:50:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:02,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:50:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:02,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 08:50:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:02,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:50:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:02,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:50:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:02,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:50:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:02,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:50:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:02,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 08:50:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-23 08:50:02,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:02,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331355141] [2023-11-23 08:50:02,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331355141] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:02,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601312079] [2023-11-23 08:50:02,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:02,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:02,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:02,307 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:50:02,308 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:50:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:02,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-23 08:50:02,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:03,003 INFO L349 Elim1Store]: treesize reduction 366, result has 30.8 percent of original size [2023-11-23 08:50:03,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 390 treesize of output 951 [2023-11-23 08:50:03,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 619 treesize of output 469 [2023-11-23 08:50:03,142 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 33 treesize of output 23 [2023-11-23 08:50:03,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:03,780 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:50:03,805 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:50:03,806 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 258 treesize of output 228 [2023-11-23 08:50:03,817 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-23 08:50:03,820 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:50:03,855 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-23 08:50:03,879 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:50:04,082 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,SelfDestructingSolverStorable12 [2023-11-23 08:50:04,082 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-23 08:50:04,088 INFO L158 Benchmark]: Toolchain (without parser) took 38025.63ms. Allocated memory was 134.2MB in the beginning and 543.2MB in the end (delta: 408.9MB). Free memory was 72.7MB in the beginning and 189.3MB in the end (delta: -116.6MB). Peak memory consumption was 303.6MB. Max. memory is 16.1GB. [2023-11-23 08:50:04,088 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory was 98.4MB in the beginning and 98.4MB in the end (delta: 25.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 08:50:04,088 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1379.99ms. Allocated memory was 134.2MB in the beginning and 178.3MB in the end (delta: 44.0MB). Free memory was 72.7MB in the beginning and 122.4MB in the end (delta: -49.7MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. [2023-11-23 08:50:04,088 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.39ms. Allocated memory is still 178.3MB. Free memory was 122.4MB in the beginning and 116.1MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 08:50:04,089 INFO L158 Benchmark]: Boogie Preprocessor took 61.83ms. Allocated memory is still 178.3MB. Free memory was 116.1MB in the beginning and 114.0MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 08:50:04,089 INFO L158 Benchmark]: RCFGBuilder took 426.79ms. Allocated memory is still 178.3MB. Free memory was 114.0MB in the beginning and 89.9MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-23 08:50:04,089 INFO L158 Benchmark]: TraceAbstraction took 36036.47ms. Allocated memory was 178.3MB in the beginning and 543.2MB in the end (delta: 364.9MB). Free memory was 88.8MB in the beginning and 189.3MB in the end (delta: -100.4MB). Peak memory consumption was 277.0MB. Max. memory is 16.1GB. [2023-11-23 08:50:04,090 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory was 98.4MB in the beginning and 98.4MB in the end (delta: 25.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1379.99ms. Allocated memory was 134.2MB in the beginning and 178.3MB in the end (delta: 44.0MB). Free memory was 72.7MB in the beginning and 122.4MB in the end (delta: -49.7MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 110.39ms. Allocated memory is still 178.3MB. Free memory was 122.4MB in the beginning and 116.1MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.83ms. Allocated memory is still 178.3MB. Free memory was 116.1MB in the beginning and 114.0MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 426.79ms. Allocated memory is still 178.3MB. Free memory was 114.0MB in the beginning and 89.9MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 36036.47ms. Allocated memory was 178.3MB in the beginning and 543.2MB in the end (delta: 364.9MB). Free memory was 88.8MB in the beginning and 189.3MB in the end (delta: -100.4MB). Peak memory consumption was 277.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-23 08:50:04,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_insert_before_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 2f0ef11561022276ce844351f7c3da39e7886059141883b3ddc06067a22b3d7d --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:50:05,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:50:06,062 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-11-23 08:50:06,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:50:06,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:50:06,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:50:06,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:50:06,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:50:06,094 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:50:06,097 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:50:06,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:50:06,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:50:06,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:50:06,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:50:06,099 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:50:06,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:50:06,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:50:06,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:50:06,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:50:06,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:50:06,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:50:06,101 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 08:50:06,101 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-23 08:50:06,101 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-23 08:50:06,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:50:06,101 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:50:06,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:50:06,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:50:06,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:50:06,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:50:06,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:50:06,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:50:06,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:50:06,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:50:06,103 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-23 08:50:06,104 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-23 08:50:06,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:50:06,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:50:06,104 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:50:06,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:50:06,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:50:06,105 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-23 08:50:06,105 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 -> 2f0ef11561022276ce844351f7c3da39e7886059141883b3ddc06067a22b3d7d Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:50:06,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:50:06,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:50:06,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:50:06,408 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:50:06,408 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:50:06,409 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_insert_before_harness.i [2023-11-23 08:50:07,561 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:50:07,918 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:50:07,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_insert_before_harness.i [2023-11-23 08:50:07,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8239588dc/ba9b5a32c5234a6e95f6b4ceb5edf63d/FLAGe0339b8a1 [2023-11-23 08:50:07,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8239588dc/ba9b5a32c5234a6e95f6b4ceb5edf63d [2023-11-23 08:50:07,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:50:07,958 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:50:07,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:50:07,958 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:50:07,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:50:07,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:50:07" (1/1) ... [2023-11-23 08:50:07,965 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ecd72ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:07, skipping insertion in model container [2023-11-23 08:50:07,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:50:07" (1/1) ... [2023-11-23 08:50:08,036 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:50:08,197 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_insert_before_harness.i[4503,4516] [2023-11-23 08:50:08,205 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_insert_before_harness.i[4563,4576] [2023-11-23 08:50:08,652 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:08,658 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:08,659 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:08,659 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:08,663 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:08,671 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:08,678 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:08,679 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:08,680 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:08,681 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:08,682 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:08,684 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:08,685 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:08,854 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:50:08,855 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:50:08,855 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:50:08,858 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:50:08,863 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:50:08,864 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:50:08,865 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:50:08,865 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:50:08,866 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:50:08,867 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:50:08,976 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:50:09,006 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-23 08:50:09,052 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:50:09,056 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_insert_before_harness.i[4503,4516] [2023-11-23 08:50:09,057 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_insert_before_harness.i[4563,4576] [2023-11-23 08:50:09,112 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,113 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,113 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,114 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,114 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,118 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,149 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,150 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,150 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,150 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,151 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,151 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,151 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,176 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:50:09,185 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:50:09,187 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:50:09,188 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:50:09,188 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:50:09,192 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:50:09,193 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:50:09,193 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:50:09,193 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:50:09,194 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:50:09,215 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:50:09,222 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:50:09,236 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_insert_before_harness.i[4503,4516] [2023-11-23 08:50:09,243 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_insert_before_harness.i[4563,4576] [2023-11-23 08:50:09,261 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,261 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,261 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,262 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,262 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,270 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,270 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,271 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,271 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,273 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,273 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,274 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,274 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:50:09,322 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:50:09,323 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:50:09,323 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:50:09,324 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:50:09,324 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:50:09,325 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:50:09,325 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:50:09,325 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:50:09,325 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:50:09,326 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:50:09,361 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:50:09,506 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:50:09,506 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:50:09,506 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:50:09,506 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:50:09,506 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:50:09,506 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:50:09,506 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:50:09,506 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:50:09,507 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:50:09,507 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:50:09,507 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:50:09,507 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:50:09,507 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:50:09,507 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:50:09,507 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:50:09,513 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:50:09,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:09 WrapperNode [2023-11-23 08:50:09,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:50:09,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:50:09,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:50:09,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:50:09,520 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:50:09" (1/1) ... [2023-11-23 08:50:09,582 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:50:09" (1/1) ... [2023-11-23 08:50:09,615 INFO L138 Inliner]: procedures = 697, calls = 1048, calls flagged for inlining = 49, calls inlined = 3, statements flattened = 51 [2023-11-23 08:50:09,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:50:09,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:50:09,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:50:09,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:50:09,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:09" (1/1) ... [2023-11-23 08:50:09,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:09" (1/1) ... [2023-11-23 08:50:09,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:09" (1/1) ... [2023-11-23 08:50:09,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:09" (1/1) ... [2023-11-23 08:50:09,671 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:09" (1/1) ... [2023-11-23 08:50:09,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:09" (1/1) ... [2023-11-23 08:50:09,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:09" (1/1) ... [2023-11-23 08:50:09,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:09" (1/1) ... [2023-11-23 08:50:09,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:50:09,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:50:09,700 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:50:09,700 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:50:09,701 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:09" (1/1) ... [2023-11-23 08:50:09,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:50:09,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:09,726 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:50:09,745 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:50:09,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:50:09,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-23 08:50:09,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:50:09,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:50:09,770 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:50:09,770 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:50:09,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:50:09,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:50:09,770 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_insert_before [2023-11-23 08:50:09,770 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_insert_before [2023-11-23 08:50:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:50:09,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:50:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:50:09,771 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:50:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:50:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:50:09,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:50:09,772 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:50:09,772 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:50:10,002 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:50:10,004 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:50:10,245 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:50:10,291 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:50:10,291 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 08:50:10,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:50:10 BoogieIcfgContainer [2023-11-23 08:50:10,291 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:50:10,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:50:10,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:50:10,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:50:10,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:50:07" (1/3) ... [2023-11-23 08:50:10,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2d91e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:50:10, skipping insertion in model container [2023-11-23 08:50:10,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:09" (2/3) ... [2023-11-23 08:50:10,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2d91e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:50:10, skipping insertion in model container [2023-11-23 08:50:10,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:50:10" (3/3) ... [2023-11-23 08:50:10,299 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_insert_before_harness.i [2023-11-23 08:50:10,312 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:50:10,312 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:50:10,356 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:50:10,365 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;@29386d21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:50:10,365 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:50:10,369 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-23 08:50:10,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 08:50:10,382 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:10,382 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:50:10,383 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:10,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:10,391 INFO L85 PathProgramCache]: Analyzing trace with hash -669486050, now seen corresponding path program 1 times [2023-11-23 08:50:10,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:50:10,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870391748] [2023-11-23 08:50:10,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:10,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:50:10,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:50:10,411 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:50:10,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-23 08:50:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:10,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-23 08:50:10,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:10,653 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 08:50:10,653 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:50:10,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:50:10,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870391748] [2023-11-23 08:50:10,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870391748] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:50:10,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:50:10,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 08:50:10,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198371425] [2023-11-23 08:50:10,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:50:10,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 08:50:10,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:50:10,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 08:50:10,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:50:10,678 INFO L87 Difference]: Start difference. First operand has 59 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 08:50:10,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:10,766 INFO L93 Difference]: Finished difference Result 113 states and 165 transitions. [2023-11-23 08:50:10,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 08:50:10,768 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2023-11-23 08:50:10,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:10,773 INFO L225 Difference]: With dead ends: 113 [2023-11-23 08:50:10,774 INFO L226 Difference]: Without dead ends: 57 [2023-11-23 08:50:10,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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:50:10,779 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:10,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:50:10,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-23 08:50:10,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-23 08:50:10,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-23 08:50:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2023-11-23 08:50:10,810 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 33 [2023-11-23 08:50:10,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:10,811 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2023-11-23 08:50:10,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 08:50:10,812 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2023-11-23 08:50:10,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 08:50:10,813 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:10,813 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:50:10,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-23 08:50:11,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:50:11,019 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:11,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:11,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1526647902, now seen corresponding path program 1 times [2023-11-23 08:50:11,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:50:11,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105044518] [2023-11-23 08:50:11,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:11,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:50:11,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:50:11,022 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:50:11,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-23 08:50:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:11,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-23 08:50:11,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:11,446 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:50:11,461 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-11-23 08:50:11,462 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 35 treesize of output 27 [2023-11-23 08:50:11,492 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 08:50:11,493 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-23 08:50:13,646 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_1 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_1) (_ bv8 64)) v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_1))) is different from true [2023-11-23 08:50:15,833 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_2 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_2) (_ bv8 64)) v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_2))) is different from true [2023-11-23 08:50:17,939 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_3 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_3) (_ bv8 64)) v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_3))) is different from true [2023-11-23 08:50:18,045 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:50:18,051 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-23 08:50:18,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:18,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:18,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 409 treesize of output 260 [2023-11-23 08:50:18,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:18,171 INFO L349 Elim1Store]: treesize reduction 103, result has 12.7 percent of original size [2023-11-23 08:50:18,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 98 [2023-11-23 08:50:18,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:19,325 INFO L349 Elim1Store]: treesize reduction 443, result has 18.7 percent of original size [2023-11-23 08:50:19,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 878 treesize of output 1043 [2023-11-23 08:50:19,795 INFO L349 Elim1Store]: treesize reduction 44, result has 42.1 percent of original size [2023-11-23 08:50:19,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 191 treesize of output 176 [2023-11-23 08:50:19,996 INFO L349 Elim1Store]: treesize reduction 83, result has 1.2 percent of original size [2023-11-23 08:50:19,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 187 treesize of output 138 [2023-11-23 08:50:20,044 INFO L349 Elim1Store]: treesize reduction 102, result has 4.7 percent of original size [2023-11-23 08:50:20,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 187 treesize of output 138 [2023-11-23 08:50:20,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 112 [2023-11-23 08:50:20,072 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 08:50:20,073 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 146 [2023-11-23 08:50:20,088 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 147 treesize of output 118 [2023-11-23 08:50:21,513 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-11-23 08:50:21,513 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:50:22,285 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 1368 treesize of output 1350 [2023-11-23 08:50:23,205 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 410 treesize of output 374 [2023-11-23 08:50:25,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:50:25,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105044518] [2023-11-23 08:50:25,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105044518] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:25,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2124959280] [2023-11-23 08:50:25,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:25,636 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-23 08:50:25,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-11-23 08:50:25,636 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-23 08:50:25,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2023-11-23 08:50:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:26,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-23 08:50:26,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:26,085 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-23 08:50:26,085 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 23 treesize of output 19 [2023-11-23 08:50:26,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-23 08:50:26,114 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 08:50:26,115 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-23 08:50:28,170 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_6 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_6) (_ bv8 64)) v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_6))) is different from true [2023-11-23 08:50:30,236 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_7 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_7) (_ bv8 64)) v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_7))) is different from true [2023-11-23 08:50:32,354 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_8 (_ BitVec 64))) (not (= v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_8 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_8) (_ bv8 64))))) is different from true [2023-11-23 08:50:32,437 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:50:32,447 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-23 08:50:32,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:33,848 INFO L349 Elim1Store]: treesize reduction 241, result has 5.9 percent of original size [2023-11-23 08:50:33,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 265 treesize of output 230 [2023-11-23 08:50:34,855 INFO L349 Elim1Store]: treesize reduction 78, result has 12.4 percent of original size [2023-11-23 08:50:34,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 265 treesize of output 254 [2023-11-23 08:50:34,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:34,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:34,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 155 [2023-11-23 08:50:34,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:34,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 68 [2023-11-23 08:50:34,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-23 08:50:34,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:50:34,964 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 81 treesize of output 48 [2023-11-23 08:50:34,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2023-11-23 08:50:34,990 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 3 [2023-11-23 08:50:39,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2023-11-23 08:50:39,642 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:50:39,972 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 1368 treesize of output 1350 [2023-11-23 08:51:24,894 WARN L293 SmtUtils]: Spent 43.87s on a formula simplification. DAG size of input: 201 DAG size of output: 136 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-23 08:51:24,894 INFO L349 Elim1Store]: treesize reduction 1178, result has 36.3 percent of original size [2023-11-23 08:51:24,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 1566 treesize of output 2369 [2023-11-23 08:51:25,454 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:51:29,105 INFO L224 Elim1Store]: Index analysis took 3150 ms [2023-11-23 08:51:30,198 INFO L349 Elim1Store]: treesize reduction 716, result has 0.1 percent of original size [2023-11-23 08:51:30,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 1049 treesize of output 1 [2023-11-23 08:51:30,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:51:30,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:51:30,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:51:30,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:51:30,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:51:30,791 INFO L224 Elim1Store]: Index analysis took 428 ms [2023-11-23 08:51:31,565 INFO L349 Elim1Store]: treesize reduction 411, result has 17.3 percent of original size [2023-11-23 08:51:31,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 724 treesize of output 993 [2023-11-23 08:51:31,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:51:31,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:51:31,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:51:31,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:51:31,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:51:32,296 INFO L349 Elim1Store]: treesize reduction 491, result has 14.9 percent of original size [2023-11-23 08:51:32,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 1081 treesize of output 1351 [2023-11-23 08:51:32,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:51:32,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:51:32,592 INFO L349 Elim1Store]: treesize reduction 78, result has 52.4 percent of original size [2023-11-23 08:51:32,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 407 treesize of output 369 [2023-11-23 08:51:32,630 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:51:32,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:51:32,805 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 592 treesize of output 516 [2023-11-23 08:51:32,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:51:32,945 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 154 treesize of output 150 [2023-11-23 08:51:33,001 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 84 treesize of output 82 [2023-11-23 08:51:38,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-11-23 08:51:41,195 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:51:41,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:51:41,266 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 49 treesize of output 63 [2023-11-23 08:51:43,820 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:51:43,821 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:51:43,881 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:51:43,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 21 [2023-11-23 08:51:43,935 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:51:44,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:51:44,036 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 49 treesize of output 63 [2023-11-23 08:51:44,577 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:51:44,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:51:44,638 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 45 treesize of output 59 [2023-11-23 08:51:44,911 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:51:44,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:51:44,945 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 45 treesize of output 59 [2023-11-23 08:51:45,002 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:51:45,002 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:51:45,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2023-11-23 08:51:45,178 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:51:45,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:51:45,246 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 189 treesize of output 185 [2023-11-23 08:51:45,580 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:51:45,640 INFO L349 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2023-11-23 08:51:45,640 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 28 treesize of output 30 [2023-11-23 08:51:45,855 INFO L349 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2023-11-23 08:51:45,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 245 treesize of output 245 [2023-11-23 08:51:46,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:51:46,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 148 treesize of output 170 [2023-11-23 08:51:48,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2124959280] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:51:48,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:51:48,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 24 [2023-11-23 08:51:48,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542496741] [2023-11-23 08:51:48,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:51:48,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-23 08:51:48,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:51:48,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-23 08:51:48,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=614, Unknown=29, NotChecked=330, Total=1056 [2023-11-23 08:51:48,370 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand has 25 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 5 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-23 08:51:51,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:51:54,113 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_6 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_6) (_ bv8 64)) v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_6))) (exists ((v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_1 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_1) (_ bv8 64)) v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_1)))) is different from true [2023-11-23 08:51:56,613 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_2 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_2) (_ bv8 64)) v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_2))) (exists ((v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_7 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_7) (_ bv8 64)) v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_7)))) is different from true [2023-11-23 08:51:58,690 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_3 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_3) (_ bv8 64)) v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_3))) (exists ((v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_8 (_ BitVec 64))) (not (= v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_8 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_8) (_ bv8 64)))))) is different from true [2023-11-23 08:52:01,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:52:04,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:52:12,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:52:14,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:52:16,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:52:18,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:52:22,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:52:22,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:52:22,797 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2023-11-23 08:52:22,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-23 08:52:22,797 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 5 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 33 [2023-11-23 08:52:22,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:52:22,800 INFO L225 Difference]: With dead ends: 83 [2023-11-23 08:52:22,800 INFO L226 Difference]: Without dead ends: 81 [2023-11-23 08:52:22,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=141, Invalid=979, Unknown=38, NotChecked=648, Total=1806 [2023-11-23 08:52:22,802 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 24 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 1 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 731 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:52:22,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 817 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 382 Invalid, 28 Unknown, 731 Unchecked, 24.3s Time] [2023-11-23 08:52:22,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-23 08:52:22,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2023-11-23 08:52:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 49 states have internal predecessors, (56), 22 states have call successors, (22), 9 states have call predecessors, (22), 10 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2023-11-23 08:52:22,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2023-11-23 08:52:22,816 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 33 [2023-11-23 08:52:22,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:52:22,816 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2023-11-23 08:52:22,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 5 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-23 08:52:22,816 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2023-11-23 08:52:22,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 08:52:22,817 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:52:22,817 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:52:22,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2023-11-23 08:52:23,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-23 08:52:23,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:52:23,222 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:52:23,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:52:23,223 INFO L85 PathProgramCache]: Analyzing trace with hash 248359460, now seen corresponding path program 1 times [2023-11-23 08:52:23,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:52:23,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661797510] [2023-11-23 08:52:23,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:23,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:52:23,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:52:23,225 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:52:23,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-23 08:52:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:23,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-23 08:52:23,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:52:23,402 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 134 treesize of output 110 [2023-11-23 08:52:23,757 INFO L349 Elim1Store]: treesize reduction 75, result has 17.6 percent of original size [2023-11-23 08:52:23,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 483 treesize of output 488 [2023-11-23 08:52:23,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 164 treesize of output 152 [2023-11-23 08:52:23,856 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 732 treesize of output 696 [2023-11-23 08:52:24,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:52:24,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-23 08:52:24,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2023-11-23 08:52:24,631 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:52:24,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 123 [2023-11-23 08:52:28,883 INFO L349 Elim1Store]: treesize reduction 84, result has 7.7 percent of original size [2023-11-23 08:52:28,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 721 treesize of output 701 [2023-11-23 08:52:28,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 152 [2023-11-23 08:52:28,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 218 treesize of output 190 [2023-11-23 08:52:28,964 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 804 treesize of output 768 [2023-11-23 08:52:33,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 177 [2023-11-23 08:52:33,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:52:33,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2023-11-23 08:52:33,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 19 treesize of output 13 [2023-11-23 08:52:33,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 1 [2023-11-23 08:53:22,814 WARN L293 SmtUtils]: Spent 48.64s on a formula simplification. DAG size of input: 172 DAG size of output: 46 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-23 08:53:22,814 INFO L349 Elim1Store]: treesize reduction 1355, result has 8.6 percent of original size [2023-11-23 08:53:22,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 12 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 15 new quantified variables, introduced 19 case distinctions, treesize of input 1896 treesize of output 2204 [2023-11-23 08:53:23,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:23,216 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 333 treesize of output 285 [2023-11-23 08:53:23,327 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 6168 treesize of output 5096 Killed by 15